package 二叉树;

import 二叉树.printer.BinaryTrees;

/**
 * @author ycc
 * @date 2024/7/17
 */
public class Test {
    public static void main(String[] args) {
        System.out.println("Hello World!");
//        int[] arr = {7, 4, 9, 2, 5, 8, 11, 1, 3, 12};
//        int[] arr = {7, 4, 9, 2, 5, 8, 11};
        int[] arr = {7, 4, 9, 2, 5, 8};

        BinarySearchTree<Integer> bst = new BinarySearchTree<>();
        for (int i = 0; i < arr.length; i++) {
            bst.add(arr[i]);
        }
        BinaryTrees.println(bst);
//        bst.prveNode((Node<Integer>)bst.root());
        bst.nextNode((Node<Integer>)bst.root());
//        BinaryTrees.printlnTest(bst);
    }
}
